On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds
نویسندگان
چکیده
This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al. (1992a). We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suces. On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds Abstract This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al. (1992a). We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suces.
منابع مشابه
A spectral updating for the method of moving asymptotes
1. Abstract The Method of Moving Asymptotes (MMA) is very popular within the structural optimization community and applies for inequality constrained nonlinear programming problems with simple bounds. In its more recent version (Svanberg, 2002), MMA was merged into the Conservative, Convex and Separable Approximation (CCSA) class of algorithms, which are globally convergent. In this work a modi...
متن کاملA globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
We consider the global and local convergence properties of a class of Lagrangian barrier methods for solving nonlinear programming problems. In such methods, simple bound constraints may be treated separately from more general constraints. The objective and general constraint functions are combined in a Lagrangian barrier function. A sequence of such functions are approximately minimized within...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملSpectral gradient methods for linearly constrained optimization
Linearly constrained optimization problems with simple bounds are considered in the present work. First, a preconditioned spectral gradient method is defined for the case in which no simple bounds are present. This algorithm can be viewed as a quasiNewton method in which the approximate Hessians satisfy a weak secant equation. The spectral choice of steplength is embedded into the Hessian appro...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Opt. and Appl.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997